Algorithms for updating minimal spanning trees
نویسندگان
چکیده
منابع مشابه
Algorithms for Updating Minimal Spanning Trees
The problem of finding the minimal spanning tree on an undirected weighted graph has been investigated by many people and O(nZ) algorithms are well known. P. M. Spira and A. Pan (Siam J. Computing 4 (1975), 375-380) present an O(n) algorithm for updating the minimal spanning tree if a new vertex is inserted into the graph. In this paper, we present another O(n) algorithm simpler than that prese...
متن کاملUpdating Directed Minimum Cost Spanning Trees
We consider the problem of updating a directed minimum cost spanning tree (DMST), when edges are deleted from or inserted to a weighted directed graph. This problem apart from being a classic for directed graphs, is to the best of our knowledge a wide open aspect for the field of dynamic graph algorithms. Our contributions include results on the hardness of updates, a dynamic algorithm for upda...
متن کاملPercolation and Minimal Spanning Trees
Consider a random set V n of points in the box n; n) d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyse the empirical distribution function F n of the lengths of edges in a minimal (Euclidean) spanning tree T n on V n. We express the limit of F n , as n ! 1, in terms of the free energies of a family of percolation processes der...
متن کاملPractical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p is the number of processors. For this case, we show that simple algorithms with dataindependent communication patterns are efficient, both in theory and in practice. The algorithms are evaluated theoretically using Va...
متن کاملManifold Learning with Geodesic Minimal Spanning Trees
In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90022-3